Anonymous obstruction-free (n, k)-set agreement with $$n-k+1$$ n - k + 1 atomic read/write registers

Anonymous Obstruction-Free (n, k)-Set Agreement with n-k+1 Atomic Read/Write Registers

The k-set agreement problem is a generalization of the consensus problem. Namely, assuming that each process proposes a value, every non-faulty process should decide one of the proposed values, and no more than k different values should be decided. This is a hard problem in the sense that we cannot solve it in an asynchronous system, as soon as k or more processes may crash. One way to sidestep...

Brief Announcement: Anonymous Obstruction-free (n, k)-Set Agreement with n–k+1 Atomic Read/Write Registers

This paper presents an obstruction-free solution to the (n, k)-set agreement problem in an asynchronous anonymous read/write system using solely (n− k+ 1) registers. We then extend this algorithm into (i) a space-optimal solution for the repeated version of (n, k)-set agreement, and (ii) an x-obstructionfree solution using (n− k + x) atomic registers (with 1 ≤ x ≤ k < n). 1 Context & motivation...

On the Rational Recursive Sequence X_{N+1}=ƔX_{N-K}+(AX_N+BX_{N-K})⁄(CX_N-DX_{N-K})

on the rational recursive sequence x_{n+1}=ɣx_{n-k}+(ax_n+bx_{n-k})⁄(cx_n-dx_{n-k})

Dynamics of higher order rational difference equation $x_{n+1}=(alpha+beta x_{n})/(A + Bx_{n}+ Cx_{n-k})$

The main goal of this paper is to investigate the periodic character, invariant intervals, oscillation and global stability and other new results of all positive solutions of the equation$$x_{n+1}=frac{alpha+beta x_{n}}{A + Bx_{n}+ Cx_{n-k}},~~ n=0,1,2,ldots,$$where the parameters $alpha$, $beta$, $A$, $B$ and $C$ are positive, and the initial conditions $x_{-k},x_{-k+1},ldots,x_{-1},x_{0}$ are...